A trivalent graph of girth 17
نویسنده
چکیده
A family of trivalent graphs is described that includes most of the known trivalent cages. A new graph in this family is the smallest trivalent graph of girth 17 yet discovered.
منابع مشابه
Some applications of pq-groups in graph theory
We describe some new applications of nonabelian pq-groups to construction problems in Graph Theory. The constructions include the smallest known trivalent graph of girth 17, the smallest known regular graphs of girth five for several degrees, along with four edge colorings of complete graphs that improve lower bounds on classical Ramsey numbers.
متن کاملA Small Trivalent Graph of Girth 14
We construct a graph of order 384, the smallest known trivalent graph of girth 14. AMS Subject Classifications: 05D25, 05D35 In this note we use a construction technique that can be viewed as a kind of generalized Cayley graph. The vertex set V of such a graph consists of the elements in multiple copies of some finite group G. The action of G on V is determined by the regular action on each of ...
متن کاملComparison of catalog of (3, g) Hamiltonian bipartite graphs with other known lists
The focus of this paper is on discussion of a catalog of a class of (3, g) graphs for even girth g. A (k, g) graph is a graph with regular degree k and girth g. This catalog is compared with other known lists of (3, g) graphs such as the enumerations of trivalent symmetric graphs and enumerations of trivalent vertex-transitive graphs, to conclude that this catalog has graphs for more orders tha...
متن کاملTrivalent 2-arc transitive graphs of type G2 are near polygonal
A connected graph Σ of girth at least four is called a near n-gonal graph with respect to E , where n ≥ 4 is an integer, if E is a set of n-cycles of Σ such that every path of length two is contained in a unique member of E . It is well known that connected trivalent symmetric graphs can be classified into seven types. In this note we prove that every connected trivalent G-symmetric graph Σ 6= ...
متن کاملOn Voltage Graphs and Cages
Using voltage graphs, we construct the the smallest known trivalent graph of girth 16. The graph has 960 vertices and is a lift of the Petersen graph. By way of preparation, other lifts of the Petersen graph are discussed. AMS Subject Classifications: 05C25, 05C35
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 24 شماره
صفحات -
تاریخ انتشار 2001